package day_2022_1_to_2.exam;

//合并两个排序的链表

public class Exam2 {

    public class ListNode {
        int val;
        ListNode next = null;

        ListNode(int val) {
            this.val = val;
        }
    }

    public class Solution {
        public ListNode Merge(ListNode list1,ListNode list2) {
            if(list1==null){
                return list2;
            }
            if(list2==null){
                return list1;
            }

            if(list1.val >= list2.val){
                list2.next=Merge(list1,list2.next);
                return list2;
            } else{
                list1.next=Merge(list1.next,list2);
                return list1;
            }
        }
    }
}
